منابع مشابه
Norms of Inverses, Spectra, and Pseudospectra of Large Truncated Wiener-Hopf Operators and Toeplitz Matrices
This paper is concerned with Wiener-Hopf integral operators on Lp and with Toeplitz operators (or matrices) on lp. The symbols of the operators are assumed to be continuous matrix functions. It is well known that the invertibility of the operator itself and of its associated operator imply the invertibility of all sufficiently large truncations and the uniform boundedness of the norms of their ...
متن کاملGroup Inverses and Drazin Inverses over Banach Algebras
For a matrix over a complex commutative unital Banach algebra, necessary and suucient conditions are given for the existence of its group inverse, and more generally, its Drazin inverses. The conditions are easy to check and explicit formulas for the inverses are provided. Some properties of the inverses and an application to operator theory are discussed. This note is a continuation of an earl...
متن کاملWiener Matrix Sequence, Hyper-Wiener Vector, Wiener Polynomial Sequence and Hyper-Wiener Polynomial of Bi-phenylene
The Wiener matrix and the hyper-Wiener number of a tree (acyclic structure), higher Wiener numbers of a tree that can be represented by a Wiener number sequence W, W,W.... whereW = W is the Wiener index, and R W k K ,.... 2 , 1 is the hyper-Wiener number. The concepts of the Wiener vector and hyper-Wiener vector of a graph are introduced for the molecular graph of bi-phenylene. Moreover, ...
متن کاملAn Lil for Cover times of Disks by Planar Random Walk and Wiener Sausage
Let Rn be the radius of the largest disk covered after n steps of a simple random walk. We prove that almost surely lim sup n→∞ (logRn)/(log n log3 n) = 1/4, where log3 denotes 3 iterations of the log function. This is motivated by a question of Erdős and Taylor. We also obtain the analogous result for the Wiener sausage, refining a result of Meyre and Werner.
متن کاملInverses of bicyclic graphs
A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s. Consider connected bipartite graphs with unique perfect matchings such that the graph obtained by contract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1979
ISSN: 0022-247X
DOI: 10.1016/0022-247x(79)90092-1